package com.jinliang.think.tree;

public class Node<T,N> {

    private T value;

    private N left;

    private N right;

    private Boolean isVist = Boolean.FALSE;

    public T getValue() {
        return value;
    }

    public void setValue(T value) {
        this.value = value;
    }

    public N getLeft() {
        return left;
    }

    public void setLeft(N left) {
        this.left = left;
    }

    public N getRight() {
        return right;
    }

    public void setRight(N right) {
        this.right = right;
    }

    public Boolean getIsVist() {
        return isVist;
    }

    public void setIsVist(Boolean vist) {
        isVist = vist;
    }
}
